单词cartesian product
un.: 笛卡尔乘积
网络: 卡氐积联结
笛卡尔乘积
The lexicographical order on the Cartesian product of a set of totally ordered sets indexed by an ordinal, is itself a total order.
在用一个序数索引的那些全序集合的笛卡尔积的一个集合上的词典序自身是全序。
In Chapter two, we prove that the cartesian product graphs of a cycle and a path satisfy the list edge coloring conjecture.
第二章证明了由圈和路构成的（笛卡儿）积图满足图的边列表着色猜想。
The size of a Cartesian product result set is the number of rows in the first table multiplied by the number of rows in the second table .
第一个表的行数乘以第二个表的行数等于笛卡尔积结果集的大小。
If the number of tuples, calculated by using the Cartesian product, exceeds the set threshold; the NON EMPTY clause is applied to the query.
如果通过使用Cartesian产品计算的元组数超过设定的阈值，将NONEMPTY子句应用于查询。
In this article, we study the restricted edge connectivity of Cartesian product and direct product of regular graphs.
本文研究正则图的笛卡尔乘积图与直接乘积图的限制边连通性。
If you introduce another for expression, the program will evaluate the Cartesian product.
如果引入了另一个for表达式，那么这个程序将对笛卡尔积求值。
In this paper , we study the crossing numbers of the cartesian product graph.
本文研究一类笛卡尔积图的交叉数。
The 1=1 one logic is in the expression to ensure the join will always be true and allows for the Cartesian Product result set.
表达式中的1=1逻辑确保连接一直为true并允许笛卡尔Product结果集。
It is the Cartesian product between the specified tables.
它是指定表的笛卡尔积。
A cross join that does not have a WHERE clause produces the Cartesian product of the tables involved in the join.
一个没有WHERE子句的交叉联接，会产生所关联表的笛卡尔乘积。